Why Church ’ s Thesis Still Holds Some Notes on Peter Wegner ’ s Tracts on
نویسندگان
چکیده
Peter Wegner’s definition of computability differs markedly from the classical term as established by Church, Kleene, Markov, Post, Turing et al.. Wegner identifies interaction as the main feature of today’s systems lacking in the classical treatment of computability. We compare the different approaches and argue whether or not Wegner’s criticism is appropriate.
منابع مشابه
Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and Computability
Peter Wegner’s definition of computability differs markedly from the classical term as established by Church, Kleene, Markov, Post, Turing et al. Wegner identifies interaction as the main feature of today’s systems which is lacking in the classical treatment of computability. We compare the different approaches and argue whether or not Wegner’s criticism is appropriate. Taking into account the ...
متن کاملInteraction, Computability, and Church’s Thesis
This article formalizes the claim that interactive finite computing agents are more expressive than Turing machines. The impact of models of interaction on Church’s thesis and Godel’s incompleteness result is explored. The evolution from algorithmic to interactive models of computation in computer architecture, software engineering, and AI is considered in a final section.
متن کاملComparative study of Daylight Design in Safavid Mosque and Renaissance Church ase studies: Jame Abbasi Mosque in Isfahan and St. Peter Church in Rome
This study compares the Safavid Mosque and the Renaissance Church in the field of daylight design. The present study seeks to answer these questions: What methods are used to provide the light in the mosque and church, and what are the similarities and differences between the “qualities of the presence of daylight” in each of these religious buildings? To limit the scope of research, Jame Abbas...
متن کاملCoinductive Models of Finite Computing Agents
This paper explores the role of coinductive methods in modeling finite interactive computing agents. The computational extension of computing agents from algorithms to interaction parallels the mathematical extension of set theory and algebra from inductive to coinductive models. Maximal fixed points are shown to play a role in models of observation that parallels minimal fixed points in induct...
متن کاملThe Church-Turing Thesis: Breaking the Myth
According to the interactive view of computation, communication happens during the computation, not before or after it. This approach, distinct from concurrency theory and the theory of computation, represents a paradigm shift that changes our understanding of what is computation and how it is modeled. Interaction machines extend Turing machines with interaction to capture the behavior of concu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997